The fundamental theorem of finite semidistributive lattices
نویسندگان
چکیده
We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff’s Distributive Lattices. Our FTFSDL is the form “A poset L finite semidistributive lattice if and only there exists set with some additional structure, such that isomorphic to admissible subsets ordered by inclusion; in this case, its structure are uniquely determined L.” The combinatorial abstraction notion torsion pairs from representation theory has geometric meaning case posets regions hyperplane arrangements. show how clarifies many constructions theory, as canonical join representations passing quotients, property interacts other major classes lattices. Many our results also apply infinite
منابع مشابه
Unbounded Semidistributive Lattices
The purpose of this note is to illustrate a construction technique which has proved useful, and apply it to solve an interesting problem. For a more complete discussion of the theory of bounded homomorphisms and lattices, see Chapter II of [3]. 1. Unbounded lattices We begin with a well known criterion for meet semidistributivity. If L is a finite lattice and a ∈ J(L), let κ(a) be the largest e...
متن کاملDerived Semidistributive Lattices
Let C(L) denote the set of covers of a poset L: γ ∈ C(L) if and only γ = (γ0, γ1) ∈ L×L and the interval {x | γ0 ≤ x ≤ γ1 } is a two elements poset. If L is a lattice then there is a natural ordering of C(L): γ ≤ δ if and only if γ0 ≤ δ0, γ1 6≤ δ0, and γ1 ≤ δ1. That is, γ ≤ δ if and only if the cover γ transposes up to δ. For α ∈ C(L) let C(L,α) denote the component of the poset C(L) connected ...
متن کاملJoin-semidistributive Lattices of Relatively Convex Sets
We give two sufficient conditions for the lattice Co(Rn, X) of relatively convex sets of Rn to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice can be embedded into Co(Rn, X), for a suitable finite subset X of Rn.
متن کاملWhaley's Theorem for Finite Lattices
Whaley’s Theorem on the existence of large proper sublattices of infinite lattices is extended to ordered sets and finite lattices. As a corollary it is shown that every finite lattice L with |L| ≥ 3 contains a proper sublattice S with |S| ≥ |L| 3 . It is also shown that that every finite modular lattice L with |L| ≥ 3 contains a proper sublattice S with |S| ≥ |L| 2 , and every finite distribut...
متن کاملCongruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Selecta Mathematica-new Series
سال: 2021
ISSN: ['1022-1824', '1420-9020']
DOI: https://doi.org/10.1007/s00029-021-00656-z